Recoverable robust single day aircraft maintenance routing problem
نویسندگان
چکیده
منابع مشابه
Recoverable robust single day aircraft maintenance routing problem
Aircraft maintenance planning is of critical importance to the safe and efficient operations of an airline. It is common to solve the aircraft routing and maintenance planning problems many months in advance, with the solution spanning multiple days. An unfortunate consequence of this approach is the possible infeasibility of the maintenance plan due to frequent perturbations occurring in opera...
متن کاملRobust weekly aircraft maintenance routing problem and the extension to the tail assignment problem
Article history: Received 23 December 2014 Received in revised form 16 February 2015 Accepted 19 March 2015
متن کاملRobust Aircraft Routing
We propose a robust optimization approach to minimize total propagated delay in the aircraft routing problem, a setting first developed by Lan et al. (2006) and then extended by Dunbar et al. (2012, 2014). Instead of minimizing the expected total propagated delay by assuming that flight leg delays follow specific probability distributions, our model minimizes the maximal possible total propagat...
متن کاملThe Recoverable Robust Facility Location Problem
This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second st...
متن کاملOn the recoverable robust traveling salesman problem
We consider an uncertain traveling salesman problem, where distances between nodes are not known exactly, but may stem from an uncertainty set of possible scenarios. This uncertainty set is given as intervals with an additional bound on the number of distances that may deviate from their expected, nominal value. A recoverable robust model is proposed, that allows a tour to change a bounded numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2014
ISSN: 0305-0548
DOI: 10.1016/j.cor.2014.03.007